Method for encoding and decoding using variable length coding and system thereof

ABSTRACT

A method for encoding using a variable length coding is provided, which includes at an encoding system, determining variable length codes for coding a data set to be encoded, dividing a corresponding code corresponding to a specific data included in the data set into a first partial code and a second partial code and storing the divided first and second partial codes at the encoding system, and compressing a first partial code, which is a set of the first partial code, and storing the compressed result at the encoding system.

CROSS-REFERENCE TO RELATED APPLICATION

The present application claims priority to Korean Patent Application No.10-2013-0160466, filed Dec. 20, 2013, which is incorporated herein byreference in its entirety.

FIELD

The present disclosure relates to encoding and decoding of data. Moreparticularly, the disclosure relates to coding and encoding usingvariable length coding.

BACKGROUND

Variable length coding is well known in the art. The variable lengthcoding is widely employed in various fields including compression ofimages or image frames etc.

The variable length coding (e.g., Huffman Coding) is a coding method inwhich frequently appearing symbols are (en)coded using short length (bitlength) codes, while the other symbols that do not frequently appear arecoded using relatively longer length codes so that the overall length ofcoded data may be shorter than that of data before coded.

It is well known that there are various variable length coding methods.An exemplary embodiment among the various variable length coding methodswill be explained herein with reference to FIG. 1.

FIG. 1 is a diagram provided to explain the conventional variable lengthcoding.

Referring to FIG. 1, when a data set (e.g., D₁ to D_(n) is specified, anencoding system may determine variable length codes to be applied forthe variable length coding of the data set.

Various methods are known that determine the variable length codescorresponding to the data set (e.g., D₁ to D_(n)).

For example, the encoding system m may determine a one-bit code (e.g.,1) as a first code corresponding to a first symbol (e.g., S₁) includedin the data set (e.g., D₁ to D_(n)), and a two-bit code (e.g., 01) as asecond code corresponding to a second symbol (e.g., S₂). Further, theencoding system may determine a third, a fourth and a fifth codes (e.g.,001, 0001, 0000) for a third, a fourth and a fifth symbols (e.g., S₃, S₄and S₅), respectively.

When the variable length codes (e.g., the first code to the fifth code)are determined as described above, the encoding system may obtainencoded code data (e.g., C₁ to C_(n)) by storing each data included inthe data set (e.g., D₁ to D_(n)) as corresponding code (e.g., one offirst to fifth codes). The encoded code data (e.g., C₁ to C_(n)) isrepresented by a set of the variable length codes.

The variable length coding is advantageous in that frequently appearingsymbols are replaced by relatively shorter-length codes so that it ispossible to obtain the code data (e.g., C₁ to C_(n)) in a length that iscompressed in comparison with the length of the original data set (e.g.,D₁ to D_(n)).

Generally, in the area which is not complicated (“flat area”) of animage (or an image frame), pixels having similar values oftenconsecutively appear. Therefore, when an image is encoded using apredetermined method, in the case of a flat area, probability is highthat the frequently appearing symbols consecutively exist together.Further, the frequently appearing symbols may be represented by thecodes having a short length when performing the variable length coding.Such a characteristic may appear when encoding various data (e.g.,documents, text and the like) as well as an image.

The discussion in this section is only to provide background for theunderstanding of the invention and does not constitute an admission ofprior art.

SUMMARY

One aspect of the present invention provides a method for encoding datacomprising a sequence of data sets using a plurality of different codeshaving the shortest code and longer codes that are longer than theshortest code. Each of the longer codes comprises a leading portion thatis in the same length as the shortest code and a trailing portion thatis the remainder following the leading portion in each of the longercodes. The method comprises assigning to each data set, one of theplurality of codes to provide a first sequence of codes representing thesequence of data sets. To provide first sequence of codes, the shortestcode is assigned to the most repeated data set in the sequence of datasets. The method comprises generating a second sequence comprising theshortest code and leading portions of the longer codes appearing in thefirst sequence, wherein the shortest code and the leading portions inthe second sequence are ordered such that each of the shortest code andthe leading portions in the second sequence sequentially corresponds toeach code of the first sequence of codes such that more repeatedpatterns are found in the second sequence than in the first sequence,wherein the shortest code appearing in the second sequence representsthe same shortest code appearing in the first sequence, wherein eachleading portion appearing in the second sequence represents a longercode of the first sequence that the leading portion originates. Themethod also comprises generating a third sequence comprising trailingportions of the longer codes appearing in the first sequence, whereinthe trailing portions in the second sequence are ordered such that eachof the trailing portions in the second sequence sequentially correspondsto each longer code of the first sequence of codes, wherein eachtrailing portion appearing in the second sequence represents a longercode of the first sequence that the leading portion originates. Themethod comprises compressing the second sequence using a datacompression software module.

In the foregoing method, to generate the second sequence, leadingportion in a predetermined length can be identified and extracted fromeach code in the first sequence of codes. To obtain the second sequence,the (extracted) leading portion can be arranged in accordance with theorder of its corresponding code from which the leading portion isextracted in the first sequence. Consequently, the leading portionsarranged in the second sequence are ordered such that each of theleading portions in the second sequence sequentially corresponds to eachcode of the first sequence of codes. The predetermined length to extractthe leading portion can be same as or shorter than the length of theshortest code for obtain more repeated patterns in the second sequencethan in the first sequence.

In the some embodiments of the present invention, the second sequence ofthe of codes can be obtained after assigning a plurality of differentcodes are without generating a separate (first) sequence of codes. Thesecond sequence of codes can be generated directly from a sequence ofdata sets when the different codes (variable length codes) areidentified for encoding the sequence of data sets.

In the present disclosure, the term “a plurality of different codes”recited in the foregoing method may also be referred to as variablelength codes. In the foregoing method, the shortest code has theshortest length of code among the plurality of codes.

In the foregoing method, another shortest code that has the same lengthas the shortest code can be assigned to a data set. In the presentdisclosure, the term “the shortest code” may also be referred to as the‘least’ code.

Another aspect of the present invention provides a method for encodingdata using a variable length coding. The method comprises determiningvariable length codes for coding a data set to be encoded at an encodingsystem; dividing a corresponding code, which is one of the variablelength codes, corresponding to a specific data included in the data setinto a first partial code and a second partial code and storing thedivided first and second partial codes; and compressing a first partialcode set, which is a set of the first partial code, and storing thecompressed result. In the foregoing method, wherein the first partialcode is at least a part of the corresponding code, which corresponds toa length of a least code having a minimum code length among the variablelength codes. In some embodiments of the foregoing method, the firstpartial code is a most significant 1 bit of the code. The foregoingmethod can further comprise determining the variable length codes, atthe encoding system, determining whether a minimum code length is apredetermined reference length or not; and performing the steps ofdividing the corresponding code and the step of compressing a firstpartial code set only when a result of the determining indicates thatthe minimum code length is the reference length. The foregoing methodalso comprises dividing the second partial code included in the secondpartial code set into a third partial code and a fourth partial code andstoring the divided partial codes; and compressing and storing a thirdpartial code set of the third partial code.

Another aspect of the present invention provides a method for decoding acode data set which is an encoded data set, using a variable lengthcoding. The method for decoding a code data set comprises, decompressinga first partial code set included in the code data set, the code dataset including the first partial code set and a second partial code setand the first partial code set being compressed and stored at a decodingsystem; acquiring a first partial code of a corresponding code thatcorresponds to a specific data from the decompressed first partial codeset and acquiring a second partial code, which is rest of thecorresponding code, from the second partial code set at the decodingsystem; and combining the acquired first partial code and second partialcode to acquire the corresponding code at the decoding system. Incertain embodiments of the foregoing method for decoding a code dataset, when the second partial code is combined with the first partialcode, the step of acquiring a second partial code, which is rest of thecorresponding code, from the second partial code set can compriseextracting bits included in the second partial code one by one from thesecond partial code set until combined code, which is combined of thefirst partial code and the extracted bits, is one of the variable lengthcodes. In the foregoing method for decoding a code data set, the step ofacquiring a second partial code, which is rest of the corresponding codeset, can comprise decompressing a third partial code set included in thesecond partial code set, the second partial code set including the thirdpartial code set and a fourth partial code set and the third partialcode set being compressed and stored; acquiring a third partial code ofa specific second partial code from the decompressed third partial codeset, and acquiring a fourth partial code that is rest of the specificsecond partial code from the fourth partial code set at the decodingsystem; and combining the acquired the third partial code and the fourthpartial code to acquire the specific second partial code at the decodingsystem.

Another aspect of the present invention provides a method for decoding acode data set. which is an encoded data set, using a variable lengthcoding, can comprise, at a decoding system, acquiring a first partialcode from a first partial code set of the code data set which is dividedinto the first partial code set and a second partial code set, and ifthe acquired first partial code is one of variable length codes,determining the first partial code to be a corresponding code thatcorresponds to a specific data; and if the acquired first partial codeis not one of the variable length codes, and when the second partialcode is combined with the first partial code, extracting bits includedin the second partial code one by one from the second partial code setuntil combined code, which is combined of the first partial code and theextracted bits, is one of the variable length codes, and determining thecombined code to be the corresponding code.

Another aspect of the present invention provides an encoding system forperforming a code dividing and storing process using a variable lengthcoding. The encoding system comprises a code determining moduleconfigured to determine variable length codes for coding a data set; anda coding module configured to store a corresponding code thatcorresponds to a specific data included in the data set. In certainembodiments of the foregoing encoding system, the coding module dividesthe corresponding code into a first partial code and a second partialcode and stores the divided result, and performs a code dividing andstoring process in which the coding module compresses a first partialcode set of the first partial code and stores the compressed result. Incertain embodiments of the foregoing encoding system, the first partialcode is at least a part of the corresponding code which corresponds to alength of a least code having a minimum code length among the variablelength codes, or is a most significant 1 bit of the corresponding code.In certain embodiments of the foregoing encoding system, the codingmodule performs the code dividing and storing process only when thelength of a least code having a minimum code length among the variablelength codes as determined by the code determining module is apredetermined reference length. In certain embodiments of the foregoingencoding system, the coding module divides a second partial codesincluded in the second partial code set into a third partial code and afourth partial code and stores the divided partial codes, and furtherperforms a second code dividing and storing process in which the codingmodule compresses a third partial code set of the third partial code andstores the compressed result.

Another aspect of the present invention provides an decoding system fordecoding a code data set which is an encoded data set, using a variablelength coding. The foregoing decoding system comprises a code dataacquisition module configured to acquire a code data from the code dataset; and a decoding module configured to decode the code data acquiredby the code data acquisition module. In certain embodiments of theforegoing decoding system, the code data acquisition module decompressesa first partial code set included in the code data set, the code dataset including the first partial code set and a second partial code set,acquires a first partial code of a corresponding code that correspondsto a specific data from the decompressed first partial code set, andacquires a second partial code which is rest of the corresponding codefrom the second partial code set, and combines the acquired firstpartial code and second partial code to acquire the corresponding code.

Another aspect of the present invention provides an decoding system fordecoding a code data set which is an encoded data set, using a variablelength coding. The decoding system comprises, a code data acquisitionmodule configured to acquire a code data from the code data set; and adecoding module configured to decode the code data acquired by the codedata acquisition module. In certain embodiments of the foregoingdecoding system, the code data acquisition module acquires a firstpartial code from the first partial code set of the code data set whichis divided into the first partial code set and a second partial codeset, if the acquired first partial code is one of the variable lengthcodes, determines the first partial code to be a corresponding code thatcorresponds to a specific data, if the acquired first partial code isnot one of the variable length codes, and when the second partial codeis combined with the first partial code, extracts bits included in thesecond partial code one by one from the second partial code set untilcombined code, which is combined of the first partial code and theextracted bits, is one of the variable length codes, and determines thecombined code to be the corresponding code.

In accordance with an embodiment of the present invention, it ispossible to obtain relatively high compression rate by dividing eachcode into at least two sets of partial codes, storing the dividedpartial codes and compressing the same rather than using the code dataitself to be obtained through the variable length coding.

Further, when dividing each code using minimum code length of thevariable length codes, there is a high probability that the bits havingthe same value consecutively appear in the set of partial codes which isset of the most significant bit (MSB) side among the sets of partialcodes which each code is divided. Accordingly, it is possible tocompress the set of partial codes which is set of the MSB side with ahigh compression rate.

Particularly, simulation result indicates that, when the minimum codelength is ‘1’, that is, when there is a code having a length of 1 bitamong the variable length codes, it is possible to obtain a remarkablyenhanced compression rate by performing processes of dividing andstoring the codes according to a technical concept of the embodiments,compared with the conventional variable length coding method.

BRIEF DESCRIPTION OF THE DRAWINGS

The above and other objects and features of the present invention willbecome apparent from the following description of the embodiments givenin conjunction with the accompanying drawings, in which:

FIG. 1 is a diagram for illustrating a variable length coding in therelated art;

FIG. 2 is a schematic diagram of an encoding system in accordance withan embodiment of the present invention;

FIGS. 3 and 4 are diagrams for illustrating processes of implementing amethod for encoding in accordance with an embodiment of the presentinvention;

FIG. 5 is a schematic diagram of a decoding system in accordance with anembodiment of the present invention;

FIGS. 6A to 6F are diagrams for illustrating a method for decoding inaccordance with an embodiment of the present invention;

FIGS. 7A and 7B are diagrams provided to explain a concept in which aset of partial codes stored in accordance with an embodiment of thepresent invention is divided and stored again; and

FIGS. 8A and 8B are diagrams illustrating an example that an embodimentof the present invention is applied to the Huffman code; and

FIGS. 9 is a schematic diagram of an computing system in accordance withan embodiment of the present invention.

DETAILED DESCRIPTION OF EMBODIMENTS

To fully understand the purpose achieved by the embodiments of thepresent invention and operational advantages thereof, reference is madeto the appended drawings illustrating preferred embodiments of thepresent invention and also to the contents shown in the drawings.

Further, in the present specification, when an element “transmits” adata to another element, it means that the element may transmit the datadirectly to another element, or to another element via one or more ofyet another elements.

On the contrary, when one element “directly transmits” a data to anotherelement, it means that the data is transmitted from the one element toanother element without passing yet another element.

Hereinafter, the embodiments of the present invention will be describedin detail with reference to the accompanying drawings. Like referencenumerals refer to like elements throughout the specification.

FIG. 2 is a schematic diagram of an encoding system in accordance withan embodiment of the present invention.

Referring to FIG. 2, an encoding system 100 in accordance with anembodiment of the present invention includes a code determining module110 and a coding module 120.

The encoding system 100 may be a system for compressing images orvideos, although not limited thereto.

The encoding system 100 may be implemented as a data processing device(e.g., a computer, or a mobile terminal), and may be implemented on thebasis of a close combination of a hardware provided in the dataprocessing device and a predetermined software configured to implementthe technical concept of the embodiments.

The expression ‘module’ as used herein may refer to a functional andstructural combination between hardware to implement the technicalconcept of the embodiments and software to drive the hardware. Forexample, the expression ‘module’ may refer to a logical unit of apredetermined code and hardware resource to implement the predeterminedcode, and those with ordinary skill in the art may easily understandthat expression ‘module’ may not always refer to physically connectedcodes or only one kind of hardware.

Depending on embodiments, the encoding system 100 may be installed onnot only a single physical device, but also a plurality of physicaldevices in a distributive manner. That is, depending on needs, theelements included in the encoding system 100 may be implemented asindependent physical device, respectively, in which case each of thephysical devices may be closely connected through a wired/wirelessnetwork to implement the encoding system 100 in accordance with thetechnical concept of the embodiments.

The code determining module 110 may determine variable length codescorresponding to a data set to be encoded.

For example, the code determining module 110 may determine the variablelength codes according to the frequency the symbols appear in the dataset. Further, the code determining module 110 may determine the shorterlength codes for the more frequently appearing symbols, and the longercode for the less frequently appearing symbols. Since the method fordetermining the variable length codes according to the variable lengthcoding (e.g., Huffman coding) is already widely known, this will not beexplained in detail below for the sake of brevity.

Once the variable length codes are determined by the code determiningmodule 110, the coding module 120 may code each data included in thedata set into any of the variable length codes.

In accordance with the technical concept of the embodiments, the codingmodule 120 may determine a code corresponding to a specific data, anddivide the determined code into at least two partial codes and store thedivided partial codes. The coding module 120 may divide and store thecode corresponding to each of the data included in the data set in thesame manner.

In accordance with an embodiment, the coding module 120 may divide in amanner such that a predetermined number of high order bits of the codeare divided as a first partial code and the rest bits of the code aredivided as a second partial code.

Further, the second partial code may not exist depending on anembodiment. That is, the first partial code may be the code itself

Depending on embodiments, the second partial code may be divided into athird and a fourth partial codes, which will be explained below withreference to FIGS. 7A and 7B.

As mentioned above, the coding module 120 may divide each code into atleast two partial codes and store the divided partial codes. The firstpartial code may be separated from the code so that the same values mayconsecutively appear in a first partial code set in which the firstpartial codes are included.

To this end, the coding module 120 may divide the first partial code fora length that corresponds to a minimum code length among the variablelength codes. In one embodiment, the minimum code length may be ‘1’.

That is, the coding module 120 may determine the variable length codes,and if there exists a code having a length of ‘1’ (i.e., 1 bit) amongthe determined variable length codes, the coding module 120 may performa code dividing and storing process in which each code is divided intothe first partial code and the second partial code and stored.

In accordance with an embodiment, the coding module 120 may perform thecode dividing and storing process as described above only when theminimum code length of the variable length codes is ‘1’, and may store asequence of the code data as it is, when the minimum code length islarger than ‘1’ as in the conventional variable length coding method.

Alternatively, in accordance with another embodiment, the coding module120 may perform the code dividing and storing process even when theminimum code length of the variable length codes is larger than ‘1’.However, as a result of simulation, it was revealed that the compressionrate of the first partial code set of the first partial codes wasconsiderably lower than the case that the minimum code length is ‘1’.

Hereinafter, embodiments will be explained with reference to the casethat the minimum code length is ‘1’, but it should be noted that thescope of the present invention may also be applied to the case that theminimum code length is larger than ‘1’.

The presence of the minimum code length ‘1’ of the variable lengthcodes, that is, the presence of a least code having a 1-bit length(e.g., code value of 1 or 0) may represent that a symbol correspondingto the least code appears substantially more frequently than the othersymbols. Therefore, when coding the data (i.e., the symbol) included inthe data set, each coded code is the least code or non-least codes, andthe most significant bit (MSB) of each code is the least code itself(e.g., when the least code is ‘1’) or has the non-least code value(e.g., ‘0’). Accordingly, the least code appears more frequently thanthe non-least codes, and probability increases that the least codeconsecutively appears.

That is, in the first partial code set which has only the MSB of therespective codes included in the code data coded through the variablelength coding, the least code (e.g., 1) appears relatively frequentlyand each MSB of the non-least codes is represented by the value (e.g.,‘0’) which is different from the least code. Further, there is highprobability that the least code consecutively appears in the firstpartial code set. Particularly, when encoding images (or videos), thereis high probability that the least codes are intensively coded in pixelscorresponding to the flat area of the image. Accordingly, for example,when the least code is ‘1’, the first partial code set may be a data setin which ‘1’ consecutively frequently appears and the rest codes are‘0’. Further, as is well known, when the same values consecutivelyfrequently appear as described above, the compression rate may berelatively high.

In conclusion, in accordance with the technical concept of theembodiments, the coding module 120 of the encoding system 100, whileperforming the coding using the variable length coding to code each dataincluded in the data set into each code included in the variable lengthcodes, may divide each code into the first and second partial codes, andstore the divided first and second partial codes. Further, the firstpartial code set of the first partial codes has a high probability thatthe same values consecutively appear therein. Therefore, when the firstpartial code set is compressed again by a predetermined method, thecompression rate of the first partial code set may be relativelyincreased. Particularly, when the first partial code is the MSB of eachcode, that is, when the length of the least code among the variablelength codes is 1 bit, the compression rate of the first partial codeset can be enhanced remarkably.

Of course, the code dividing and storing process for dividing respectivecodes and storing the divided codes may be performed as described aboveeven when the length of the least code is not ‘1’. In this case, thehigh order bits corresponding to the length of the least code, i.e., tothe minimum code length may be divided from the respective codes as thefirst partial code.

Further, depending on embodiments, 1-bit MSB of each code may be simplydivided as the first partial code even when the length of the least codeis not ‘1’. Even in this case there is no loss of compression rate.

FIGS. 3 and 4 are diagrams provided to explain processes of a method forencoding in accordance with an embodiment.

Referring to FIG. 3, a predetermined data set (e.g., D₁ to D_(n), 10)may be input from outside or calculated by the encoding system 100. Thecode determining module 110 may then determine the variable length codesfor use in coding of the data set 10. It is assumed that the determinedvariable length codes are those that are shown in FIG. 1.

The coding module 120 may then determine the code data (e.g., C₁ toC_(n), 20) corresponding to the data set 10. The predetermined codeC_(n) included in the code data may be a code corresponding to thepredetermined data D_(n) included in the data set 10. Conventionally,the code data 20 itself is output as a result of encoding or the codedata 20 is compressed by a predetermined method to output encodingresult.

However, in accordance with the technical concept of the embodiments,the coding module 120 may divide the code data 20 into the first partialcode set (e.g., C₁(i) to C_(n)(i), 30) and the second partial code set(e.g., C₁(ir) to C_(n)(ir), 40), and store the divided partial codes. Asused herein, C_(n)(i) may represent i number of high order bits of (n)thcode. Further, as described above, T may be ‘1’. Furthermore, C_(n)(ir)may represent the rest bits other than the i number of high order bitsof the (n)th code.

When the first partial code set 30 is divided as mentioned above, thecompression rate can be further increased than the case the code data 20is compressed. Of course, the second partial code set 40 also may becompressed and stored.

The processes shown in FIG. 3 will be described in greater detail belowwith reference to FIG. 4.

As illustrated in FIG. 4, a sequence of symbols (e.g., S₁, S₂, S₁, S₂,S₃, S₄, S₅, S₁, S₁, S₁ and so on) may be included in the data set 10.That is, D₁, D₂ and D₃ shown in FIG. 3 may respectively be a firstsymbol (S₁), a second symbol (S₂) and the first symbol (S₁), and soforth for the rest data.

Further, it may be assumed that the variable length codes as shown inFIG. 1 (e.g., 1, 01, 001, 0001 and 0000) are determined with respect toeach of the symbols (e.g., S₁ to S₅) included in the data set 10.

The code data 20 corresponding to the data set 10 may then be like thoseshown in FIG. 4.

That is, the symbols [S₁, S₂, S₁, S₂, S₃, S₄, S₅, S₁, S₁, S₁] may becoded into [1, 01, 1, 01, 001, 0001, 0000, 1, 1, 1], respectively. Atthis time, since the least code is ‘1’, the minimum code length may be 1bit. Therefore, the coding module 120 may perform the code dividing andstoring process that divides each code of [1, 01, 1, 01, 001, 0001,0000, 1, 1, 1] included in the code data 20 and stores each dividedcode.

The first partial code may be one high order bit corresponding to ‘1’that is the minimum code length of each code. That is, the first partialcode may be the MSB of each code.

Depending on embodiments, the first partial code may be the mostsignificant 1 bit of each code even when the length of the least code islarger than ‘1’. That is, the first partial code absolutely may be themost significant 1 bit of each code irrespective of the length of theleast code.

In accordance with the technical concept of the embodiments, even in theabovementioned embodiment, loss of the compression rate will not beexperienced, since one of the codes (e.g., code 0001) is simply dividedinto the MSB (e.g., 0) and the rest bits (e.g., 001) and stored.However, when only each MSB of each code is separately divided and eachdivided MSB is stored, there is high probability that the data havingthe same value consecutively appear (and this is particularly true forflat area of an image), thus the compression rate may increase.

Then, the first partial code set 30 generated by the coding module 120may be [1, 0, 1, 0, 0, 0, 0, 1, 1, 1] as shown in FIG. 4. Further, thesecond partial code set 40 generated by the coding module 120 may be [1,1, 01, 001, 000] as shown in FIG. 4. It can be identified that thesecond partial code corresponding to a predetermined code (e.g., theleast code) may not exist. That is, for the least code ‘1’, only thefirst partial code exists and the second partial code may not exist.Therefore, the first of the second partial code ‘1’ of the secondpartial code set 40 may be the second partial code of the second code(e.g., ‘01’ of C₂), and the second partial code of the first code (i.e.,‘1’ of C₁) may not be stored in the second partial code set 40.Consequently, the size of the second partial code set 40 may be smallerthan that of the code data 20.

As described above, when the code data 20 is divided into the firstpartial code set 30 and the second partial code set 40 and stored, thecoding module 120 may store at least the first partial code set 30.Further, the values of the first partial code (‘0’ or ‘1’) may besequentially included in the first partial code set 30 as shown in FIG.4.

Further, in the first partial code set 30, there may be high probabilitythat the least code (e.g., ‘1’) relatively frequently appears and theleast code appears consecutively. Furthermore, the first partial codesof the codes which are not the least code have the same value (e.g.,‘0’), thus when the first partial code set 30 is compressed, thecompression rate may be relatively much higher than that of the case thecode data 20 itself is compressed.

In some embodiments of the present invention, the first partial code set30 and the second partial code set 40 can be obtained directly from thedata set 10, given a set of variable length codes for encoding the dataset 10.

Further, the coding module 120 may perform the code dividing and storingprocess on the second partial code set 40 in the same manner describedabove. This will be described below with reference to FIGS. 7A and 7B.

FIGS. 7A and 7B are diagrams provided to explain a concept in which aset of partial codes stored in accordance with an embodiment of thepresent invention is divided and stored again.

Referring to FIGS. 4, 7A and 7B, when the code dividing and storingprocess is performed on the code data 20 by the coding module 120, asshown in FIG. 4, the first partial code set 30 and the second partialcode set 40 may be generated as a result of the code dividing andstoring process. At this time, the variable length codes correspondingto the code data 20 may be as shown in FIG. 7A.

As shown in FIG. 7A, the first partial codes may be included in thefirst partial code set 30. That is, the first partial codescorresponding to the symbols S1, S2, S3, S4 and S5 may be ‘1’, ‘0’, ‘0’,‘0’ and ‘0’, respectively. And, the second partial codes correspondingto the symbols S2, S3, S4 and S5 may be ‘1’, ‘01’, ‘001’, and ‘000’,respectively.

Then, if the second partial codes are assumed as the variable lengthcodes corresponding to the second partial code set 40, the code dividingand storing process is performed on the second partial code set 40 inthe same manner. Further, as described above, the code dividing andstoring process for the second partial code set 40 also may be performedonly when the minimum code length of the variable length codescorresponding to the second partial code set 40 is 1. The code dividingand storing process also may be performed even when the minimum codelength of the variable length codes is larger than ‘1’ as describedabove, the MSB of each code and the rest bits may absolutely be dividedand stored, as mentioned above.

Since the minimum code length of the variable length codes(e.g., 1, 01,001, 000) corresponding to the second partial code set 40 is 1 in FIG.7A, the code dividing and storing process also may be performed on thesecond partial code set 40.

As shown in FIG. 7B, the second partial codes (e.g., 1, 01, 001, 000)included in the second partial code set 40 may be divided into a thirdpartial code (1, 0, 0, 0) and a fourth partial code (x, 1, 01, 00) to bestored. When the second partial code is ‘1’, the fourth partial codecorresponding thereto may not exist as described above.

Then, the second partial code set 40 [1, 1, 01, 001, 000, . . . ] shownin FIG. 4 may be divided into the third partial code set [1, 1, 0, 0, 0,. . . ] and the fourth partial code set [1, 01, 00, . . . ] and thedivided third and fourth partial code sets may be stored. Further, whenthe third partial code set which is set of the third partial codes iscompressed, it is possible to obtain more higher compression rate thanthe case the second partial code set 40 is compressed.

On the other hand, the decoding method for decoding the encoded datausing the present invention's encoding method will be described withreference to FIGS. 5 and 6.

FIG. 5 is a schematic diagram of a decoding system in accordance with anembodiment of the present invention. FIGS. 6A to 6F are diagrams forillustrating a method for decoding in accordance with an embodiment ofthe present invention.

Referring to FIGS. 5 and 6, the decoding system 200 in accordance withan embodiment of the present invention includes a code data acquisitionmodule 210 and a decoding module 220.

The decoding system 200 also may be implemented by a predetermined dataprocessing device (e.g., a computer, a mobile terminal and the like),and may be implemented by combining a hardware provided in theprocessing device and a predetermined software code defined so that thetechnical concept can be implemented. The decoding system 200 and theencoding system 100 may be implemented by installing the same softwareto the data processing device. That is, the encoding system 100 and thedecoding system 200 may be implemented at the same time by installingone software (or application) to the data processing device.

The decoding system 200 may perform decoding on the code data setencoded using the encoding system in accordance with an embodiment ofthe present invention. The code data set includes at least two partialcode sets (e.g., 30 and 40), and at least one of the partial code sets(e.g., the first partial code set 30) is compressed (e.g., a zip or thelike) and stored.

The code data acquisition module 210 may acquire a code data (e.g., thereference numeral ‘20’ shown in FIG. 3 or FIG. 4). Then, the decodingmodule 220 may acquire the data set (e.g., 10) by decoding the code data(e.g., 20). The decoding module 220 may decoding with reference to atree or a table including the variable length codes.

Further, the code data acquisition module 210 may decompress thecompassion of the first partial code set 30 which is compressed to bestored in order to acquire the code data (e.g., 20) from the code dataset. The second partial code set 40 also may be compress to be stored,and also may be decompressed.

Then, the code data acquisition module 210 may acquire the first partialcode from the decompressed first partial code set (e.g., 30) and mayacquire the second partial code corresponding to the first partial codefrom the second partial code set (e.g., 40). Further, a predeterminedcode included in the code data 20 may be acquired by combining theacquired first and second partial codes.

At this time, the code data acquisition module 210 may acquire the codefrom only the first partial code, and the second partial code may notexist. In this case, the first partial code may be the least code itselfamong the variable length codes as described above.

The processes for acquiring the code data from the code data set by thecode data acquiring module 210 may be as shown in FIG. 6A to 6F.

FIGS. 6A to 6F are diagrams illustrating processes of decoding the dataset which is the encoding is performed as shown in FIG. 4.

Referring to FIG. 6A, the first partial code set and the second partialcode set may be included in the code data set. The first partial codeset (e.g., 30) may be compressed and stored, the second partial code set(e.g., 40) also may be compressed and stored depending on theimplementation example.

The code data acquiring module 210 may acquire the first partial codeset (e.g., 30) and the second partial code set (e.g., 40) shown in FIG.6A by decompressing the compression thereof. Here, the length of thefirst partial code of the first partial code set (e.g., 30) may be 1.When the length of the first partial code is larger than 1 (e.g., 2),the code data acquisition module 210 may extract partial code of eachbits corresponding to the value (e.g., 2) from the first partial codeset (e.g., 30) to generate the code to be included in the code data 20.FIGS. 6A to 6F show the case when the length of the first partial codeis 1.

Further, the code data acquiring module 210 may maintain preset pointers31 and 41 to determine the partial code which is supposed to beextracted from each partial code set 30 and 40.

The first pointer 31 of the first partial code set (e.g., 30) and thesecond pointer 41 of the second partial code set (e.g., 40) may indicatethe values which are supposed to be preferentially extracted from eachpartial code set. Then, the code data acquiring module 210 may extractthe first-first partial code (e.g., 1) from the first partial code set(e.g., 30). The first-first partial code has a value of ‘1’, and said‘1’ is the least code itself(that is, one of variable length codes),thus, the first-first partial code itself may be a code. Accordingly,the code data acquiring module 210 may not extract any data from thesecond partial code set (e.g., 40). Then, said ‘1’ is recorded in thecode data 20 and may be the first code in the code data 20. Since thepartial code is extracted from the first partial code set (e.g., 30),the first pointer 31 may be adjusted to indicate the next partial code.Meanwhile, since the partial code is not extracted from the secondpartial code set (e.g., 40), the second pointer 41 may not be adjusted.

Then, the code data acquiring module 210 may acquire the next code,i.e., the second code. Such processes are shown in FIG. 6B.

The code data acquiring module 210 may extract the second partial code(‘0’) that the first pointer 31 of the first partial code set (e.g., 30)indicates. Since the second partial code (‘0’) is not the least code(‘1’)(or (one of variable length codes), the code data acquiring module210 may extract the value corresponding to the second pointer 41, andthen the second pointer 41 may be adjusted to indicate the next partialcode.

Then, the code data acquiring module 210 may determine whether combinedcode, which is combined of the second partial code (0) extracted fromthe first partial code set (e.g., 30) and the value or bit (1) extractedfrom the second partial code set (e.g., 40) is one of variable lengthcodes.

The second partial code (0) extracted from the first partial code set(e.g., 30) and the value (1) extracted from the second partial code set(e.g., 40) are combined to be ‘01’, the ‘01’ is included in the variablelength codes (shown in FIG. 1). Therefore, the ‘01’ may be determined asthe second code of the code data 20.

Thereafter, as shown in FIG. 6C, the code data acquiring module 210 mayacquire the third code of the code data 20. To this end, the value whichthe first pointer 31 indicates is extracted, the extracted value is theleast code (1), thus no value may be extracted from the second partialcode set (e.g., 40). If so, the third code of the code data 20 may be‘1’.

Thereafter, as shown in FIG. 6D, the code data acquiring module 210 mayacquire the fourth code of the code data 20. To this end, the value (0)which the first pointer 31 indicates is extracted, the extracted valueis not the least code (1), thus the value which the second pointer 41indicates may be extracted from the second partial code set (e.g., 40).Then, it is possible to determine whether the combined code (01), whichis combination of the value (0) extracted from the first partial codeset (e.g., 30) and the value (1) extracted from the second partial codeset (e.g., 40) is included in the variable length codes. Since thecombined code (01) is included in the variable length codes, thecombined code (01) may be the fourth code of the code data 20.

Thereafter, as shown in FIG. 6E, the code data acquiring module 210 mayacquire the fifth code of the code data 20. To this end, the value (0)which the first pointer 31 indicates is extracted, the extracted valueis not the least code (1), thus the value (0) which the second pointer41 indicates may be extracted from the second partial code set (e.g.,40). Then, it is possible to determine whether the combined code (00),combination of the value (0) extracted from the first partial code set(e.g., 30) and the value (0) extracted from the second partial code set(e.g., 40), is included in the variable length codes. Since the combinedcode (00) is not included in the variable length codes, the code dataacquisition module 210 may increase the second pointer 41 by 1 toextract the next value or bit (1) of the second partial code set (e.g.,40). Then, it is possible to determine whether the combined code (001)of the extracted values is included in the variable length codes. Sincethe combined code (001) is included in the variable length codes, thecombined code (001) may be the fifth code of the code data 20.

Thereafter, as shown in FIG. 6F, the code data acquiring module 210 mayacquire the sixth code of the code data 20. To this end, the value (0)which the first pointer 31 indicates is extracted, the extracted valueis not the least code (1), thus the value (0) which the second pointer41 indicates may be extracted from the second partial code set (e.g.,40). Then, it is possible to determine whether the combination code(00), combination of the value (0) extracted from the first partial codeset (e.g., 30) and the value (0) extracted from the second partial codeset (e.g., 40), is included in the variable length codes. Since thecombined code (00) is not included in the variable length codes, thecode data acquisition module 210 may increase the second pointer 41 by 1to extract one more bit, the next value (0) of the second partial codeset (e.g., 40).

Then, it is possible to determine again whether the combined code (000)of the extracted values is included in the variable length codes. Sincethe combined value (000) is not included in the variable length codes,the code data acquisition module 210 may increase the second pointer 41by 1 again to extract the next value (1) of the second partial code set(e.g., 40). Then, it is possible to determine whether the combined code(0001) of the extracted values is included in the variable length codes.Since the combined value (0001) is included in the variable lengthcodes, the combined value (0001) may be the sixth code of the code data20.

In this manner, the code data acquisition module 210 may obtain the codedata 20 from the decompressed first partial code set (e.g., 30) andsecond partial code set (e.g., 40).

In summary, the processes that the code data acquisition module 210acquires the code data 20 are as follows. The code data acquisitionmodule 210 extracts the value corresponding to the minimum code length,and then if the extracted value is included the variable length codes,the value extracted from the first partial code set (e.g., 30) becomethe code of the code data 20. If the value extracted from the firstpartial code set (e.g., 30) is not included in the variable lengthcodes, while extracting a value(or bit) one by one from the secondpartial code set (e.g., 40), the code data acquisition module 210 maysequentially extract the value in the second partial code set (e.g., 40)until combined code, the combination of the value extracted from thefirst partial code set (e.g., 30) and the value extracted from thesecond partial code set (e.g., 40), is included in the variable lengthcodes. Then, if the combined code is included in the variable lengthcodes, the combination code may be the code of the code data 20.

In this manner, the code data acquisition module 210 may acquire thecode data (e.g., 20) from the code data set (e.g., 30 and 40). Then, thedata set (e.g., 10) may be acquired from the acquired code data (e.g.,20).

Further, as described above, the second partial code set (40) also maybe divided into at least two partial code sets (e.g., the third andfourth partial code sets) and the divided partial code sets may bestored. In this case, the code data acquisition module 210 maydecompress the compression of the third and/or the fourth partial codesets, may acquire the third partial code which is at least a part of aspecific second partial code from the decompressed third partial codeset, and acquire the fourth partial code which is the rest part of thespecific second partial code from the fourth partial code set. Then, thesecond partial code may be acquired by combining the acquired the thirdand the fourth partial codes.

It can be easily understood by anyone who has an ordinary skill in theart that such processes described above also may be performed by thecode data acquisition module 210 in the same manner as described inFIGS. 6A to 6F.

That is, the code data acquisition module 210 extracts a valuecorresponding to the minimum code length from the third partial codeset, and if the extracted value is included in the second partial code(e.g., 1, 01, 001, 000 shown in FIG. 7A), the value extracted from thethird partial code may be the second partial code.

On the other hand, if the value extracted from the third partial codeset in not included in the second partial code, while extracting a valueone by one from the fourth partial code set, the code data acquisitionmodule 210 may sequentially extract the value in the fourth partial codeset until combined code , the combination of the value extracted fromthe third partial code set and the value extracted from the fourthpartial code set, is included in the second partial code. Then, if thecombination code is included in the second partial codes, thecombination value may be the second partial code.

In the end, in accordance with the technical concept of the presentinvention, it can be understood in FIG. 4 to FIG. 6F that even if thecode data is divided into at least two partial code sets and the dividedpartial code sets are stored, the amount of data is substantially thesame as the case when the code data itself is stored. Further, thecompression rate in at least one of the at least two partial code setsbecomes much high so that the overall compression rate of the code databecomes high.

Further, in the embodiment described above (e.g., FIGS. 1, 7A or 7B),exemplified is only the case that the difference between the length ofthe least code (i.e., the code having the minimum code length, e.g.,‘1’) in the variable length codes and that of a second least code (i.e.,the code having the minimum code length other than the least code, e.g.,‘01’) is 1. However, even in case that the difference between the lengthof the least code and that of the second least code is larger than 1,the technical concept of the present invention also may be applied.

For example, FIGS. 8A and 8B are diagrams illustrating an example thatan embodiment of the present invention is applied to the Huffman code.As shown in FIG. 1 or FIG. 7A, FIG. 8A illustrates the Huffman tree thatthe difference between the length of the least code (e.g., ‘1’corresponding to the symbol S1) and that of the second least code (e.g.,‘01’ corresponding to the symbol S2) is 1; and FIG. 8B illustrates theHuffman tree that the difference between the length of the least code(e.g., ‘1’ corresponding to the symbol S1) and that of the second leastcode (e.g., ‘011’, ‘001’, ‘000’ respectively corresponding to thesymbols S2, S3, S4) is 2.

Describing the technical concept of the present invention using Huffmantree, the technical concept described above may be applied to the tree50 (i.e., the tree that the root thereof is node 51). Then, the firstpartial code set and the second partial code set may be divided inaccordance with the technical concept of the present invention. Then,the divided second partial code set may correspond to the first subtree(i.e., the tree that the root is node 52) of the tree 50. As describedin FIGS. 7A and 7B, if the technical concept of the present invention isapplied to the first subtree, the first subtree may divided into thethird partial code set and the fourth partial code set, and the fourthpartial code set may correspond to the second subtree (i.e., the treehaving a root of node 53).

In this manner, the code dividing and storing process as described abovemay be applied to the tree corresponding to the entire variable lengthcodes, and then the code dividing and storing process may be selectivelyapplied to the subtree of the tree.

For example, as shown in FIG. 8B, the code dividing and storing processmay be performed on the tree 60 i.e., the tree having a root of node 61.Then, each MSB of each code is divided and each divided MSB is stored asa first partial code set, and the rest bits may be stored as the seconddivision code set. The first division code set is a set that only eachMSB of the codes is collected, and the length of the least code (S₁)is 1. Therefore, the compression rate of the first division code set maybe relatively high.

The second partial code set may correspond to the first subtree (i.e.,the tree having a root of node 62). The code dividing and storingprocess may be selectively performed on the first subtree. For example,the MSB is divided from the first subtree and may be stored as the thirdpartial code set and the fourth partial code set. The compression rateof the third division code set may be lower than that of the firstpartial code set. Further, when the compression rate is not so high, thecompression may not be performed. Even if the compression is notperformed, each code is divided to be stored as described above and thesize of data does not become large. Therefore, no loss may exist in thecompression rate.

In this manner, the code dividing and storing process may be selectivelyperformed on each subtree (e.g., each subtree having a root of node 63,node 64 and node 65 and the like).

The method for encoding and decoding in accordance with an embodiment ofthe present invention may be implemented by computer-readable codes in acomputer-readable storage medium.

While the present invention has been described with reference to anembodiment shown in the drawings, this is merely an example and it willbe understood to those skilled in the art that various modifications andvariations can be made from the above description. Accordingly, thescope of the present invention should be determined by the technicalconcept of the following claims.

In some embodiments, any of the systems, servers, or componentsreferenced herein may take the form of a computing system as shown inFIG. 9. FIG. 9 is a block diagram showing one embodiment of a computingsystem 900. The exemplary computing system 900 includes a centralprocessing unit (CPU) 905, which may include one or more conventionalmicroprocessors that comprise hardware circuitry configured to readcomputer-executable instructions and to cause portions of the hardwarecircuitry to perform operations specifically defined by the circuitry.The computing system 900 may also include a memory 930, such as randomaccess memory (RAM) for temporary storage of information and a read onlymemory (ROM) for permanent storage of information, which may store someor all of the computer-executable instructions prior to beingcommunicated to the processor for execution. The computing system mayalso include one or more mass storage devices 920, such as a hard drive,diskette, CD-ROM drive, a DVD-ROM drive, or optical media storagedevice, that may store the computer-executable instructions forrelatively long periods, including, for example, when the computersystem is turned off. Typically, the modules of the computing system areconnected using a standard based bus system. In different embodiments,the standard based bus system could be Peripheral Component Interconnect(PCI), Microchannel, Small Computer System Interface (SCSI), IndustrialStandard Architecture (ISA) and Extended ISA (EISA) architectures, forexample. In addition, the functionality provided for in the componentsand modules of computing system may be combined into fewer componentsand modules or further separated into additional components and modules.The illustrated structure of the computing system 900 may also be usedto implement other computing components and systems described in thedisclosure. It is recognized that the components discussed herein may beimplemented as different types of components. For example, a server maybe implemented as a module executing on a computing device or amainframe may be implemented on a non-mainframe server, a server orother computing device may be implemented using two or more computingdevices, and/or various components could be implemented using a singlecomputing devices.

In one embodiment, the computing system 900 comprises a server, aworkstation, a mainframe, and a minicomputer. In other embodiments, thesystem may be a personal computer that is IBM, Macintosh, or Linux/Unixcompatible, a laptop computer, a tablet, a handheld device, a mobilephone, a smart phone, a personal digital assistant, a car system, or atablet. The servers may include a variety of servers such as databaseservers (for example, Oracle, DB2, Informix, Microsoft SQL Server,MySQL, or Ingres), application servers, data loader servers, or webservers. In addition, the servers may run a variety of software for datavisualization, distributed file systems, distributed processing, webportals, enterprise workflow, form management, and so forth.

The computing system 900 may be generally controlled and coordinated byoperating system software, such as Windows 95, Windows 98, Windows NT,Windows 2000, Windows XP, Windows Vista, Windows 7, Windows 8, Unix,Linux, SunOS, Solaris, Maemeo, MeeGo, BlackBerry Tablet OS, Android,webOS, Sugar, Symbian OS, MAC OS X, or iOS or other operating systems.In other embodiments, the computing system 900 may be controlled by aproprietary operating system. Conventional operating systems control andschedule computer processes for execution, perform memory management,provide file system, networking, I/O services, and provide a userinterface, such as a graphical user interface (GUI), among other things.

The computing system 900 includes one or more commonly availableinput/output (I/O) devices and interfaces 910, such as a keyboard,mouse, touchpad, speaker, microphone, or printer. In one embodiment, theI/O devices and interfaces 910 include one or more display device, suchas a touchscreen, display or monitor, which allows the visualpresentation of data to a user. More particularly, a display deviceprovides for the presentation of GUIs, application software data, andmultimedia presentations, for example. The central processing unit 905may be in communication with a display device that is configured toperform some of the functions defined by the computer-executableinstructions. For example, some of the computer-executable instructionsmay define the operation of displaying to a display device, an imagethat is like one of the screenshots included in this application. Thecomputing system may also include one or more multimedia devices 940,such as speakers, video cards, graphics accelerators, and microphones,for example. A skilled artisan would appreciate that, in light of thisdisclosure, a system including all hardware components, such as thecentral processing unit 905, display device, memory 930, and massstorage device 920 that are necessary to perform the operationsillustrated in this application, is within the scope of the disclosure.

In the embodiment of FIG. 9, the I/O devices and interfaces provide acommunication interface to various external devices and systems. Thecomputing system may be electronically coupled to a network, whichcomprises one or more of a LAN, WAN, the Internet, or cloud computingnetworks, for example, via a wired, wireless, or combination of wiredand wireless, communication link. The network communicates with varioussystems or other systems via wired or wireless communication links.

Information may be provided to the computing system 900 over a networkfrom one or more data sources. The network may communicate with otherdata sources or other computing devices. The data sources may includeone or more internal or external data sources. In some embodiments, oneor more of the databases or data sources may be implemented using arelational database, such as Sybase, Oracle, CodeBase and Microsoft® SQLServer as well as other types of databases such as, for example, a flatfile database, an entity-relationship database, and object-orienteddatabase, or a record-based database.

In the embodiment of FIG. 9, the computing system 900 also includes acoding/decoding module 950, which may be executed by the CPU 905, to runone or more of the processes discussed herein. This module may include,by way of example, components, such as software components,object-oriented software components, class components and taskcomponents, processes, functions, attributes, procedures, subroutines,segments of program code, drivers, firmware, microcode, circuitry, data,databases, data structures, tables, arrays, or variables. In oneembodiment, the coding / decoding module 950 corresponds to the codingmodule 120 and/or the decoding module 220.

Embodiments can be implemented such that all functions illustratedherein are performed on a single device, while other embodiments can beimplemented in a distributed environment in which the functions arecollectively performed on two or more devices that are in communicationwith each other. Moreover, while the computing system has been used todescribe one embodiment of the encoding system 100 and/or the decodingsystem 200, it is recognized that the user systems may be implemented ascomputing systems as well.

In general, the word “module,” as used herein, refers to logic embodiedin hardware or firmware, or to a collection of software instructions,possibly having entry and exit points, written in a programminglanguage, such as, for example, Java, Lua, C or C++. A software modulemay be compiled and linked into an executable program, installed in adynamic link library, or may be written in an interpreted programminglanguage such as, for example, BASIC, Perl, or Python. It will beappreciated that software modules may be callable from other modules orfrom themselves, or may be invoked in response to detected events orinterrupts. Software instructions may be embedded in firmware, such asan EPROM. It will be further appreciated that hardware modules may becomprised of connected logic units, such as gates and flip-flops, or maybe comprised of programmable units, such as programmable gate arrays orprocessors. The modules described herein are preferably implemented assoftware modules, but may be represented in hardware or firmware.Generally, the modules described herein refer to logical modules thatmay be combined with other modules or divided into sub-modules despitetheir physical organization or storage.

It is recognized that the term “remote” may include systems, data,objects, devices, components, or modules not stored locally, that arenot accessible via the local bus. Thus, remote data may include a systemthat is physically stored in the same room and connected to thecomputing system via a network. In other situations, a remote device mayalso be located in a separate geographic area, such as, for example, ina different location, country, and so forth.

Each of the processes, methods, and algorithms described in thepreceding sections may be embodied in, and fully or partially automatedby, code modules executed by one or more computer systems or computerprocessors comprising computer hardware. The code modules may be storedon any type of non-transitory computer-readable medium or computerstorage device, such as hard drives, solid-state memory, optical disc,and/or the like. The systems and modules may also be transmitted asgenerated data signals (for example, as part of a carrier wave or otheranalog or digital propagated signal) on a variety of computer-readabletransmission mediums, including wireless-based and wired/cable-basedmediums, and may take a variety of forms (for example, as part of asingle or multiplexed analog signal, or as multiple discrete digitalpackets or frames). The processes and algorithms may be implementedpartially or wholly in application-specific circuitry. The results ofthe disclosed processes and process steps may be stored, persistently orotherwise, in any type of non-transitory computer storage such as, forexample, volatile or non-volatile storage.

In addition, it is recognized that a feature shown in one figure may beincluded in a different display or interface, module, or system. Also,the reference numbers listed in the description are hereby incorporatedby reference into the figures and the corresponding elements of thefigures are deemed to include the corresponding reference numbers fromthe description.

The various features and processes described above may be usedindependently of one another, or may be combined in various ways. Allpossible combinations and sub-combinations are intended to fall withinthe scope of this disclosure. In addition, certain method or processblocks may be omitted in some implementations. The methods and processesdescribed herein are also not limited to any particular sequence, andthe blocks or states relating thereto can be performed in othersequences that are appropriate. For example, described blocks or statesmay be performed in an order other than that specifically disclosed, ormultiple blocks or states may be combined in a single block or state.The example blocks or states may be performed in serial, in parallel, orin some other manner. Blocks or states may be added to or removed fromthe disclosed example embodiments. The example systems and componentsdescribed herein may be configured differently than described. Forexample, elements may be added to, removed from, or rearranged comparedto the disclosed example embodiments.

Conditional language, such as, among others, “can,” “could,” “might”, or“may,” unless specifically stated otherwise, or otherwise understoodwithin the context as used, is generally intended to convey that certainembodiments include, while other embodiments do not include, certainfeatures, elements and/or steps. Thus, such conditional language is notgenerally intended to imply that features, elements and/or steps are inany way required for one or more embodiments or that one or moreembodiments necessarily include logic for deciding, with or without userinput or prompting, whether these features, elements and/or steps areincluded or are to be performed in any particular embodiment. The term“including” means “included but not limited to”. The term “or” means“and/or”.

Any process descriptions, elements, or blocks in the flow or blockdiagrams described herein and/or depicted in the attached figures shouldbe understood as potentially representing modules, segments, or portionsof code which include one or more executable instructions forimplementing specific logical functions or steps in the process.Alternate implementations are included within the scope of theembodiments described herein in which elements or functions may bedeleted, executed out of order from that shown or discussed, includingsubstantially concurrently or in reverse order, depending on thefunctionality involved, as would be understood by those skilled in theart.

All of the methods and processes described above may be embodied in, andpartially or fully automated via, software code modules executed by oneor more general-purpose computers. For example, the methods describedherein may be performed by the computing system and/or any othersuitable computing device. The methods may be executed on the computingdevices in response to execution of software instructions or otherexecutable code read from a tangible computer readable medium. Atangible computer readable medium is a data storage device that canstore data that is readable by a computer system. Examples of computerreadable mediums include read-only memory, random-access memory, othervolatile or non-volatile memory devices, CD-ROMs, magnetic tape, flashdrives, and optical data storage devices.

It should be emphasized that many variations and modifications may bemade to the above-described embodiments, the elements of which are to beunderstood as being among other acceptable examples. All suchmodifications and variations are intended to be included herein withinthe scope of this disclosure. The foregoing description details certainembodiments. It will be appreciated, however, that no matter howdetailed the foregoing appears in text, the systems and methods can bepracticed in many ways. For example, a feature of one embodiment may beused with a feature in a different embodiment. As is also stated above,it should be noted that the use of particular terminology whendescribing certain features or aspects of the systems and methods shouldnot be taken to imply that the terminology is being re-defined herein tobe restricted to including any specific characteristics of the featuresor aspects of the systems and methods with which that terminology isassociated.

What is claimed is:
 1. A method of encoding, comprising: providing datacomprising plurality of data sets, which are arranged to form a sequenceof data sets; providing a plurality of codes comprising a first codehaving the shortest code length, the plurality of codes furthercomprising longer codes that are longer than the first code, whereineach of the longer codes comprises a leading portion and a trailingportion, wherein the leading portion is in the same length as the firstcode, wherein the trailing portion is the remainder following theleading portion in each of the longer codes; assigning to each data set,one of the plurality of codes to form a first sequence of codesrepresenting the sequence of data sets, wherein the first code isassigned to the most repeated data set in the sequence of data sets;generating a second sequence using the first code and the leadingportions of the longer codes appearing in the first sequence, in whichfor a longer code in the first sequence, a leading portion of the longercode enters in the second sequence and, for the first code in the firstsequence, the same first code enters in the second sequence, wherein thefirst code and the leading portions in the second sequence are arrangedin an order in which each of the first code and the leading portions inthe second sequence sequentially corresponds to each code of the firstsequence of codes; and compressing the second sequence using a datacompression software module .
 2. The method of claim 1, furthercomprising: generating a third sequence using the trailing portions ofthe longer codes appearing in the first sequence, wherein the trailingportions in the second sequence are arranged in an order in which eachof the trailing portions in the second sequence sequentially correspondsto each longer code of the first sequence of codes, wherein eachtrailing portion appearing in the second sequence sequentiallycorresponds to a longer code of the first sequence that the leadingportion originates.
 3. The method of claim 1, wherein each data setrepresents a portion of an image, wherein the most repeated data set isa data set that is most frequently appearing in the sequence of datasets, wherein each code in the second sequence sequentially correspondsto each code of the first sequence such that a code at a relativeposition in the first sequence of codes corresponds to a code at thesame relative position in the second sequence of codes.
 4. The method ofclaim 1, wherein the plurality of codes further comprising a second codethat is in the same code length as the first code, wherein the secondcode is assigned to one of the plurality of data sets in the firstsequence of data set.
 5. The method of claim 4, wherein the second codeis assigned to the second most repeated data set in the sequence of datasets.
 6. A computer program stored in a computer readable recordingmedium in which the program is for executing the method of claim
 1. 7. Amethod for encoding data using a variable length coding, the methodcomprising: a) at an encoding system, determining variable length codesfor coding a data set to be encoded; b) at the encoding system, dividinga corresponding code, which is one of the variable length codes,corresponding to a specific data included in the data set into a firstpartial code and a second partial code and storing the divided first andsecond partial codes; and c) at the encoding system, compressing a firstpartial code set, which is a set of the first partial code, and storingthe compressed result.
 8. The method of claim 7, wherein the firstpartial code is at least a part of the corresponding code, whichcorresponds to a length of a least code having a minimum code lengthamong the variable length codes.
 9. The method of claim 7, wherein thefirst partial code is a most significant 1 bit of the code.
 10. Themethod of claim 7, further comprising: when determining the variablelength codes, at the encoding system, determining whether a minimum codelength is a predetermined reference length or not; and performing thesteps b) and c) only when a result of the determining indicates that theminimum code length is the reference length.
 11. The method of claim 7,wherein the step b) further comprises: At the encoding system, dividingthe second partial code included in the second partial code set into athird partial code and a fourth partial code and storing the dividedpartial codes; and compressing and storing a third partial code set ofthe third partial code.
 12. A computer program stored in a computerreadable recording medium in which the program is for executing themethod of claim 7.